Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 3606034
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 18, 20262026-05-18T21:11:53+00:00 2026-05-18T21:11:53+00:00

I have created a binary search tree with {2,5,3,4,9,1,7,…,100} digits. how can i save

  • 0

I have created a binary search tree with {2,5,3,4,9,1,7,...,100} digits.

how can i save it as preorder?
thanks

EDIT: Consider I have { 3,7,1,2} and make a binary search tree with these digits and I want to save this tree as preorder which is {3,1,2,7}

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-18T21:11:54+00:00Added an answer on May 18, 2026 at 9:11 pm

    Seeh here on literateprograms :

    public List<E> toList() {
        List<E> result = new ArrayList<E>();
        treeToList(root, result);
        return result;
    }
    
    private void treeToList(Node<E> node, List<E> goal) {
        if (node != null) {
            treeToList(node.left, goal);
            goal.add(node.value);
            treeToList(node.right, goal);
        }
    }
    

    A complete article on binary trees and PreOrder traversals.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a binary search tree created in C. The problem is I can't
I'm working on a project where I have to make a binary search tree
I have a binary tree class that is created with a root node and
I have created a file with XmlDocument xmldoc = new XmlDocument(); Can I make
I have to implement a binary search tree using C++ for one of assignments.
I am trying to create a custom Binary Search Tree, and I have everything
Hey guys, I have created a tree which is not a binary tree. Now,
I currently have a binary search tree setup, utilizing templates to allow me to
I'm trying to make a list of all items in a binary search tree.
SQL Server uses binary tree with intermediate and leaf node for search but how

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.