You are viewing a single comment's thread. Return to all comments →
can be done even more elegantly (less null checks)
void Preorder(Node root) {
if (root != null) { System.out.print(root.data + " "); Preorder(root.left); Preorder(root.right); }
}
Seems like cookies are disabled on this browser, please enable them to open this website
Tree: Preorder Traversal
You are viewing a single comment's thread. Return to all comments →
can be done even more elegantly (less null checks)
void Preorder(Node root) {
}