KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I did'nt mean binary search tree. for example, if I insert values 1,2,3,4,5 in to a binary search tree the inorder traversal will give 1,2,3,4,5 as output. but if I insert the same values in to a binary tree, the inorder traversal should give 4,2,5,1,3 as output. Binary tree can be created using dynamic arrays in which for each element in index n, 2n+1 and 2n+2 represents its left and right childs respectively. so representation and level order traversal is very easy here. but I think, in-order,post-order,pre-order is difficult. my question is how can we create a binary tree like a binary search tree. ie. have a tree class which contains data, left and right pointers instead of arrays. so that we can recursively do traversal.
Tags (comma-separated)
Save Edits
Cancel