Please enable JavaScript.
Coggle requires JavaScript to display documents.
計算機概論PP.4流程, printInOrder, InsertNode (BinaryTree), InsertNode…
計算機概論PP.4流程
建立BinaryTree
輸入同樣的數列
InsertNode (BinaryTree)
InsertNode (BinarySearchTree)
輸入結果
printInOrder
printInOrder
建立BinarySearchTree
printInOrder
根不為空
根為空
InsertNode (BinaryTree)
根為空
填入根
根不為空
current ← root
current.left不為空
current.right為空
填入current.right
current.right不為空
填入的值為奇數
current ← current.left
1 more item...
填入的值為偶數
current ← current.right
current.left為空
填入current.left
InsertNode (BinarySearchTree)
根為空
填入根
根不為空
current← root
填入的值小於current.value
current.left為空
填入current.left
current.left不為空
current ← current.left
填入的值大於current.value
current.right為空
填入current.right
current.right不為空
current ← current.right
printInOrder(*Node current)
printInOrder(current→left)
輸出current.value
printInOrder(current→right)
若current.left不為空
若current.right不為空