Description: Each node in a binary tree is an ordered tree up to two sub-tree. Usually sub-tree is called " left sub-tree" (left subtree) and " right subtree" (right subtree). Binary tree is often used to implement a binary search tree and binary heap. Notably, the binary tree is not a special case. In graph theory, a binary tree is a connected acyclic graph, and the degree of each vertex is not more than 3.
To Search:
File list (Check if you may need any files):
MyQueue.h
MyStack.cpp
MyStack.h
Record.cpp
Record.h
utility.h
Binary_node.cpp
Binary_node.h
Binary_tree.cpp
Binary_tree.h
Key.cpp
Key.h
Main.cpp
MyQueue.cpp
Download