Build Red Black Tree from sorted list: truble with colors

Multi tool use
Multi tool use












0














I'm trying to join two Red Black Trees in O(m+n).
I have understanded the algorithmic logic behind the process but I'm still in trouble about the colors of the nodes.



I have a vector in which there are all the nodes (all black )ordered by their key. I use the inorder traversal to build the Red Black Tree. In the same time i want to color the red nodes, that should be the deepest ones in the tree.



I have already did some research about and I found someone saying: "Notice that, when you split the array of keys in half, the two halves have either exactly the same number of keys, or they differ by one. When they have exactly the same number of keys, assigning colors is easy. When they don't, you might need to use some red nodes..."



The problem is that I dont'have any kind of idea of which nodes i have to color red. Can please someone help me?










share|improve this question







New contributor




Alessio Maddaluno is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

























    0














    I'm trying to join two Red Black Trees in O(m+n).
    I have understanded the algorithmic logic behind the process but I'm still in trouble about the colors of the nodes.



    I have a vector in which there are all the nodes (all black )ordered by their key. I use the inorder traversal to build the Red Black Tree. In the same time i want to color the red nodes, that should be the deepest ones in the tree.



    I have already did some research about and I found someone saying: "Notice that, when you split the array of keys in half, the two halves have either exactly the same number of keys, or they differ by one. When they have exactly the same number of keys, assigning colors is easy. When they don't, you might need to use some red nodes..."



    The problem is that I dont'have any kind of idea of which nodes i have to color red. Can please someone help me?










    share|improve this question







    New contributor




    Alessio Maddaluno is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.























      0












      0








      0







      I'm trying to join two Red Black Trees in O(m+n).
      I have understanded the algorithmic logic behind the process but I'm still in trouble about the colors of the nodes.



      I have a vector in which there are all the nodes (all black )ordered by their key. I use the inorder traversal to build the Red Black Tree. In the same time i want to color the red nodes, that should be the deepest ones in the tree.



      I have already did some research about and I found someone saying: "Notice that, when you split the array of keys in half, the two halves have either exactly the same number of keys, or they differ by one. When they have exactly the same number of keys, assigning colors is easy. When they don't, you might need to use some red nodes..."



      The problem is that I dont'have any kind of idea of which nodes i have to color red. Can please someone help me?










      share|improve this question







      New contributor




      Alessio Maddaluno is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      I'm trying to join two Red Black Trees in O(m+n).
      I have understanded the algorithmic logic behind the process but I'm still in trouble about the colors of the nodes.



      I have a vector in which there are all the nodes (all black )ordered by their key. I use the inorder traversal to build the Red Black Tree. In the same time i want to color the red nodes, that should be the deepest ones in the tree.



      I have already did some research about and I found someone saying: "Notice that, when you split the array of keys in half, the two halves have either exactly the same number of keys, or they differ by one. When they have exactly the same number of keys, assigning colors is easy. When they don't, you might need to use some red nodes..."



      The problem is that I dont'have any kind of idea of which nodes i have to color red. Can please someone help me?







      red-black-tree






      share|improve this question







      New contributor




      Alessio Maddaluno is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|improve this question







      New contributor




      Alessio Maddaluno is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|improve this question




      share|improve this question






      New contributor




      Alessio Maddaluno is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked Dec 27 '18 at 16:38









      Alessio Maddaluno

      1




      1




      New contributor




      Alessio Maddaluno is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      Alessio Maddaluno is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      Alessio Maddaluno is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





























          active

          oldest

          votes











          Your Answer






          StackExchange.ifUsing("editor", function () {
          StackExchange.using("externalEditor", function () {
          StackExchange.using("snippets", function () {
          StackExchange.snippets.init();
          });
          });
          }, "code-snippets");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "1"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });






          Alessio Maddaluno is a new contributor. Be nice, and check out our Code of Conduct.










          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53948166%2fbuild-red-black-tree-from-sorted-list-truble-with-colors%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown






























          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          Alessio Maddaluno is a new contributor. Be nice, and check out our Code of Conduct.










          draft saved

          draft discarded


















          Alessio Maddaluno is a new contributor. Be nice, and check out our Code of Conduct.













          Alessio Maddaluno is a new contributor. Be nice, and check out our Code of Conduct.












          Alessio Maddaluno is a new contributor. Be nice, and check out our Code of Conduct.
















          Thanks for contributing an answer to Stack Overflow!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          To learn more, see our tips on writing great answers.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53948166%2fbuild-red-black-tree-from-sorted-list-truble-with-colors%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          1i6Ro1iUY1F0ZlDOY,02ov GhwIlPmLUN qwICnXUAHsBoNpyP23 XuQ5dxJJFsMlXtHsoJBf
          sDdMV 6dtL5epRIF73c y7

          Popular posts from this blog

          Monofisismo

          Angular Downloading a file using contenturl with Basic Authentication

          Olmecas